A complete rewriting system for a monoid of tree transformation classes
نویسندگان
چکیده
منابع مشابه
Complete Rewriting System for the Chinese Monoid
In this paper we are interested in the Chinese monoid and show that the Chinese monoid has complete rewriting system. Mathematics Subject Classification: 16S15; 20F05; 20F10; 20M50; 68Q42
متن کاملA Complete Term Rewriting System for Decimal
We present a term rewriting system for decimal integers with addition and subtraction. We prove that the system is connuent and terminating.
متن کاملa study on construction of iranian life tables: the case study of modified brass logit system
چکیده ندارد.
15 صفحه اولA Complete Term Rewriting System for Decimal Integer Arithmetic
We present a term rewriting system for decimal integers with addition and subtraction. We prove that the system is connuent and terminating.
متن کاملActions of a separately strict cpo-monoid on pointed directed complete posets
In the present article, we study some categorical properties of the category {$bf Cpo_{Sep}$-$S$} of all {separately strict $S$-cpo's}; cpo's equipped with a compatible right action of a separately strict cpo-monoid $S$ which is strict continuous in each component. In particular, we show that this category is reflective and coreflective in the category of $S$-cpo's, find the free a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1990
ISSN: 0890-5401
DOI: 10.1016/0890-5401(90)90054-l